Balanced and 1-balanced graph constructions

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: Keywords: Balanced graphs 1-balanced graphs Cartesian product of graphs Web graphs a b s t r a c t There are several density functions for graphs which have found use in various applications. In this paper, we examine two of them, the first being given by b(G) = |E(G)|/|V (G)|, and the other being given by g(G) = |E(G)|/(|V (G)| − ω(G)), where ω(G) denotes the number of components of G. Graphs for which b(H) ≤ b(G) for all subgraphs H of G are called balanced graphs, and graphs for which g(H) ≤ g(G) for all subgraphs H of G are called 1-balanced graphs (also sometimes called strongly balanced or uniformly dense in the literature). Although the functions b and g are very similar, they distinguish classes of graphs sufficiently differently that b(G) is useful in studying random graphs, g(G) has been useful in designing networks with reduced vulnerability to attack and in studying the World Wide Web, and a similar function is useful in the study of rigidity. First we give a new characterization of balanced graphs. Then we introduce a graph construction which generalizes the Cartesian product of graphs to produce what we call a generalized Cartesian product. We show that generalized Cartesian product derived from a tree and 1-balanced graphs are 1-balanced, and we use this to prove that the generalized Cartesian products derived from 1-balanced graphs are 1-balanced.